Arthur Rubin

Arthur Rubin

at the Aquarium of the Pacific in August 2006
Born 1956 (age 55–56)
Residence Southern California
Citizenship United States
Nationality American
Fields Mathematician
Alma mater Caltech
Doctoral advisor Alexander S. Kechris

Arthur Leonard Rubin (born 1956) is an American mathematician.

Contents

Biography

As an undergraduate he placed among the top five competitors in the William Lowell Putnam Competition on four occasions (1970–73),[1] a feat matched by only six other undergraduate students since the first competition in 1938.[2] He first became Putnam Fellow at the age of 14 (in 1970), making him the youngest person at the time to have achieved this feat.[3] This achievement was lauded in the popular press, which described him as a genius.[4] Rubin's undergraduate adviser, Gary Lorden, was described as saying that a person of Rubin's mathematical ability shows up in the United States "about once in every ten years".[4] His mother was Jean E. Rubin, a professor of mathematics at Purdue University for over 35 years, and his father, Herman Rubin, is a professor of statistics at the same university.[5]

In 1978, Rubin earned his Ph.D. at the California Institute of Technology, under the direction of Alexander S. Kechris. Rubin's dissertation was entitled "Free Algebras in Von Neumann–Bernays–Gödel Set Theory and Positive Elementary Inductions in Reasonable Structures".[6]

Shortly after, in 1979, Rubin co-authored a paper on list coloring of graphs with Paul Erdős, giving him an Erdős number of 1.[7] In addition, Rubin has published papers on the following topics:

Other notable accomplishments

References

  1. ^ editors Gerald L. Alexanderson; Leonard F. Klosinski; Loren C. Larson (1985). The William Lowell Putnam Mathematical Competition Problems and Solutions 1965-1984. Mathematical Association of America. pp. 141–142. ISBN 0883854635. 
  2. ^ Mathematical Association of America. "The Mathematical Association of America's William Lowell Putnam Competition". http://www.maa.org/awards/putnam.html. Retrieved 2006-04-25. "Individual Putnam Fellows: Arthur L. Rubin, California Institute of Technology" 
  3. ^ Joseph Gallian. "The Putnam Competition from 1938-2009". http://www.d.umn.edu/~jgallian/putnam06.pdf. Retrieved 2010-09-25. 
  4. ^ a b Stingley, Jim (May 13, 1974). "Caltech Math Whiz". Los Angeles Times. http://pqasb.pqarchiver.com/latimes/access/645142392.html?dids=645142392:645142392&FMT=ABS&FMTS=ABS:AI&date=May+13%2C+1974&author=JIM+STINGLEY&pub=Los+Angeles+Times&desc=CALTECH+MATH+WHIZ&pqatl=google. "Arthur Rubin is to the mathematics world what Pegasus would be to the Kentucky Derby. In the universe of calculation, he is a 400-pound wrestler matched against Don Knotts." 
  5. ^ Dinah L. McClure, editor (2002). "Obituary: J. E. H. Rubin". Sequel (38): 2. Archived from the original on 2006-09-02. http://web.archive.org/web/20060902184206/http://www.science.purdue.edu/Sequel/sequel+38.pdf. Retrieved 2006-04-25. "Professor Jean E. Hirsh Rubin, 75, died on October 25, 2002, in Lafayette. Born on October 29, 1926 in New York City, she had lived in West Lafayette since 1967. She received her M.A. degree from Queens College, the M.S. from Columbia University and her Ph.D from Stanford University. She was a Professor of Mathematics at Purdue for 35 years. She married Herman Rubin, Professor of Statistics, in 1952. She is also survived by her son, Arthur Rubin of Brea, California, and her daughter, Leonore Findsen of Orlando, Florida" 
  6. ^ Mathematics Genealogy Project. "Arthur Rubin". http://www.genealogy.ams.org/html/id.phtml?id=10490. Retrieved 2006-12-16. 
  7. ^ P. Erdős, A. L. Rubin and H. Taylor (1979). "Choosability in graphs". Proc. West Coast Conf. on Combinatorics, Graph Theory and Computing, Congressus Numerantium XXVI: 125–157. 
  8. ^ P. E. Howard, A. L. Rubin, & J. E. Rubin (1979). "Kinna–Wagner Selection Principles, Axioms of Choice and Multiple Choice". Monatshefte fur Mathematkik, 123 (4): 309–319. doi:10.1007/BF01326766. 
  9. ^ Arthur L. Rubin, Jean E. Rubin: Weak Forms of the Axiom of Choice and the Generalized Continuum Hypothesis. Math. Log. Q. 39: 7-22 (1993)
  10. ^ E. C. Posner & A.L. Rubin, (1984). "Capacity of digital links in tandem.". IEEE Transactions on Information Theory IT-30 (3): 464–470. doi:10.1109/TIT.1984.1056917. 
  11. ^ T. K. Truong, I. S. Reed, R. G. Lipes, A. L. Rubin, & S. A. Butman, (1984). "Digital SAR processing using a fast polynomial transform". IEEE Transactions on Acoustics, Speech, and Signal Processing ASSP-32 (2): 419–425. doi:10.1109/TASSP.1984.1164307. 
  12. ^ Greitzer, S (March 1973). "The First U.S.A Mathematical Olympiad". American Mathematical Monthly (Mathematical Association of America) 80 (3): 276–281. doi:10.2307/2318449. JSTOR 2318449. 
  13. ^ Ward, Mike (June 3, 1984). "Most Senators, Assemblymen Unchallenged". Los Angeles Times. http://pqasb.pqarchiver.com/latimes/access/676835132.html?dids=676835132:676835132&FMT=ABS&FMTS=ABS:AI&type=historic&date=Jun+03,+1984&author=&pub=Los+Angeles+Times&desc=Most+Senators,+Assemblymen+Unchallenged&pqatl=google. 

External links